Further Experimentations On The Scalability OfThe
نویسندگان
چکیده
This paper reports the recent developments of the Gene Expression Messy Genetic Algorithm (GEMGA) research. It presents extensive experimental results for large problems with massive multi-modality, non-uniform scaling, and overlapping sub-problems. All the experimental results corroborate the linear time performance of the GEMGA for a wide range of problems, that can be decomposed into smaller overlapping and non-overlapping sub-problems in the chosen representation. These results further support the scalable performance of the GEMGA.
منابع مشابه
Dynamic configuration and collaborative scheduling in supply chains based on scalable multi-agent architecture
Due to diversified and frequently changing demands from customers, technological advances and global competition, manufacturers rely on collaboration with their business partners to share costs, risks and expertise. How to take advantage of advancement of technologies to effectively support operations and create competitive advantage is critical for manufacturers to survive. To respond to these...
متن کاملOwnership in Name, But not Necessarily in Action; Comment on “It’s About the Idea Hitting the Bull’s Eye”: How Aid Effectiveness Can Catalyse the Scale-up of Health Innovations”
A recently-published paper by Wickremasinghe et al assesses the scalability of pilot projects in three countries using the aid effectiveness agenda as an analytical framework. The authors report uneven progress and recommend applying aid effectiveness principles to improve the scalability of projects. This commentary focuses on one key principle of aid effectiveness – country ownership; it desc...
متن کاملOn Parallel Scalable Uniform SAT Witness Generation
Constrained-random verification (CRV) is widely used in industry for validating hardware designs. The effectiveness of CRV depends on the uniformity of test stimuli generated from a given set of constraints. Most existing techniques sacrifice either uniformity or scalability when generating stimuli. While recent work based on random hash functions has shown that it is possible to generate almos...
متن کاملMesh Based Peer to Peer Live Video Streaming using ANT Algorithm
Data distribution and data retrieval has always been an integral part of the Internet. In particular, video streaming has been gaining popularity over the last few decades. Though there has been no shortage of innovations and Experimentations, no single system has been able to deliver highly scalable and reduce congestion to the requesting users. The development of p2p technologies brings unpre...
متن کاملPrivacy Preserving Distributed K-Means Clustering in Malicious Model Using Verifiable Secret Sharing Scheme
In this article, the authors propose an approach for privacy preserving distributed clustering that assumes malicious model. In the literature, there do exist, numerous approaches that assume a semi honest model. However, such an assumption is, at best, reasonable in experimentations; rarely true in real world. Hence, it is essential to investigate approaches for privacy preservation using a ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998